A primal-simplex based Tardos' algorithm

An enhanced primal-simplex based Tardos’ algorithm

The authors recently proposed a simplex-based Tardos’ algorithm which is strongly polynomial if the coefficient matrix is totally unimodular and the auxiliary problems are non-degenerate. Motivated by the algorithmic practically of such methods, we introduce a modification which circumvents the determination of the largest sub-determinant while keeping the same theoretical performance. Assuming...

Solving fully fuzzy Linear Programming Problem using Breaking Points

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

A new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming

Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Equivalence of the primal and dual simplex algorithms for the maximum flow problem

In this paper, we study the primal and dual simplex algorithms for the maximum flow problem. We show that aVny primal simplex algorithm for the maximum flow problem can be converted into a dual simplex algorithm that performs the same number of pivots and runs in the same time. The converse result is also true though in a somewhat weaker form.